A Hierarchy of primitive recursive sequence functions
نویسندگان
چکیده
— In this paper we give a characterization of primitive recursive functions ƒ : N~* N{r^0, s>0) and define a Hierarchy of classes b^O) of these functions by a syntactic measure ofeomplexity. The behavior ofthe classes J^a+b^ respect to different operators is also analyzed. The classes J^ + b coincide with the ones ofCleavé's hierarchy for a^2,b^0 and give a refinement of the Meyer-Ritchie hierarchy.
منابع مشابه
Primitive recursive functions versus partial recursive functions: comparing the degree of undecidability
Consider a decision problem whose instance is a function. Its degree of undecidability, measured by the corresponding class of the arithmetic (or Kleene-Mostowski) hierarchy hierarchy, may depend on whether the instance is a partial recursive or a primitive recursive function. A similar situation happens for results like Rice Theorem (which is false for primitive recursive functions). Classical...
متن کاملTotal Recursion over Lexicographical Orderings: Elementary Recursive Operators Beyond PR
In this work we generalize primitive recursion in order to construct a hierarchy of terminating total recursive operators which we refer to as leveled primitive recursion of order i(PRi). Primitive recursion is equivalent to leveled primitive recursion of order 1 (PR1). The functions constructable from the basic functions make up PR0. Interestingly, we show that PR2 is a conservative extension ...
متن کاملRanking Primitive Recursions: The Low Grzegorczyk Classes Revisited
Traditional results in subrecursion theory are integrated with the recent work in “predicative recursion” by defining a simple ranking ρ of all primitive recursive functions. The hierarchy defined by this ranking coincides with the Grzegorczyk hierarchy at and above the linearspace level. Thus, the result is like an extension of the Schwichtenberg/Müller theorems. When primitive recursion is re...
متن کاملTHE a - UNION THEOREM AND GENERALIZED PRIMITIVE RECURSION
A generalization to a-recursion theory of the McCreight-Meyer Union Theorem is proved. Theorem. Let <5> be an a-computational complexity measure and {ft\e < a) an a-r.e. strictly increasing sequence of a-recursive functions. Then there exists an a-recursive function k such that C* ~ U «<aC/f • The proof entails a no-injury cancellation atop a finite-injury priority construction and necessitates...
متن کاملUpper and Lower Bounds on Continuous-Time Computation
We consider various extensions and modifications of Shannon’s General Purpose Analog Computer, which is a model of computation by differential equations in continuous time. We show that several classical computation classes have natural analog counterparts, including the primitive recursive functions, the elementary functions, the levels of the Grzegorczyk hierarchy, and the arithmetical and an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ITA
دوره 13 شماره
صفحات -
تاریخ انتشار 1979